The Asymmetric Leximin Solution

نویسنده

  • Bram W. Driesen
چکیده

In this article we define and characterize a class of asymmetric leximin solutions, that contains both the symmetric leximin solution of Imai [5] and the two-person asymmetric Kalai-Smorodinsky solution of Dubra [3] as special cases. Solutions in this class combine three attractive features: they are defined on the entire domain of convex n-person bargaining problems, they generally yield Pareto efficient solution outcomes, and asymmetries among bargainers are captured by a single parameter vector. The characterization is based on a strengthening of Dubra’s [3] property Restricted Independence of Irrelevant Alternatives (RIIA). RIIA imposes Nash’s [9] IIA, under the added condition that the contraction of the feasible set preserves the mutual proportions of players’ utopia values. Our axiom, entitled RIIA for Independent Players (RIP), says RIIA holds for a group of players, given that the contraction of the feasible set does not affect players outside that group. JEL-Classification: C78

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents

Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individua...

متن کامل

Truncated Leximin solutions

This paper shows that three classic properties for bargaining solutions in an environment with a variable number of agents – Anonymity, Individual Monotonicity and Consistency – characterize a one-parameter class of Truncated Leximin solutions. Given a positive and possibly infinite α, a Truncated Leximin solution gives each agent the minimum of α and their Leximin solution payoff. JEL-Classifi...

متن کامل

Proportional Concessions and the Leximin Solution

In this article we introduce a new axiom for bargaining solutions, named Proportional Concession Monotonicity (PCM), which imposes that no player benefit when all players collectively make proportional concessions with respect to their respective utopia values. We reconsider the leximin solution (Imai, 1983), and obtain an alternative characterization on the basis of PCM. JEL-Classification: C78

متن کامل

Leximin Asymmetric Multiple Objective DCOP on Factor Graph

1 Nagoya Institute of Technology, Gokiso-cho Showa-ku Nagoya 466-8555, Japan {matsui.t, matsuo}@nitech.ac.jp 2 Florida Institute of Technology, Melbourne FL 32901, United States of America [email protected] 3 Kobe University, 5-1-1 Fukaeminami-machi Higashinada-ku Kobe 658-0022, Japan {tenda, hirayama}@maritime.kobe-u.ac.jp 4 Kyushu University, 744 Motooka Nishi-ku Fukuoka 819-0395, Japan yokoo@...

متن کامل

A Leximin Allocations in the Real World

As part of a collaboration with a major California school district, we study the problem of fairly allocating unused classrooms in public schools to charter schools. Our approach revolves around the randomized leximin mechanism. We extend previous work to the classroom allocation setting, showing that the leximin mechanism is proportional, envy-free, efficient, and group strategyproof. We also ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012